On the general excess bound for binary codes with covering radius one
نویسندگان
چکیده
منابع مشابه
On the covering radius of some binary cyclic codes
We compute the covering radius of some families of binary cyclic codes. In particular, we compute the covering radius of cyclic codes with two zeros and minimum distance greater than 3. We compute the covering radius of some binary primitive BCH codes over F2f , where f = 7, 8.
متن کاملOn the Covering Radius Problem for Codes I . Bounds on Normalized Covering Radius
In this two-part paper we introduce the notion of a stable code and give a new upper bound on the normalized covering radius ofa code. The main results are that, for fixed k and large n, the minimal covering radius t[n, k] is realized by a normal code in which all but one of the columns have multiplicity l; hence tin + 2, k] t[n, k] + for sufficiently large n. We also show that codes with n _-<...
متن کاملOn the covering radius of codes
Designing a good error-correcting code is a packing problem. The corresponding covering problem has received much less attention: now the codewords must be placed so that no vector of the space is very far from the nearest codeword. The two problems are quite different, and with a few exceptions good packings, i.e. codes with a large minimal distance, are usually not especially good coverings. ...
متن کاملLinear codes with covering radius 3
The shortest possible length of a q-ary linear code of covering radius R and codimension r is called the length function and is denoted by q(r, R). Constructions of codes with covering radius 3 are here developed, which improve best known upper bounds on q(r, 3). General constructions are given and upper bounds on q(r, 3) for q = 3, 4, 5, 7 and r ≤ 24 are tabulated.
متن کاملOn binary linear completely regular and completely transitive codes with arbitrary covering radius
An infinite class of binary linear completely regular and completely transitive codes is given. The covering radius of these codes is growing with the length of the code.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.07.024